An Information-Theoretic Proof of the Constructive Commutative Quantum Lovász Local Lemma
نویسندگان
چکیده
The Quantum Lovász Local Lemma (QLLL) [AKS12] establishes non-constructively that any quantum system constrained by a local Hamiltonian has a zero-energy ground state, if the local Hamiltonian terms overlap only in a certain restricted way. In this paper, we present an efficient quantum algorithm to prepare this ground state for the special case of commuting projector terms. The related classical problem has been open for more than 34 years. Our algorithm follows the breakthrough ideas of Moser’s [Mos09] classical algorithm and lifts his information theoretic argument to the quantum setting. A similar result has been independently published by Arad and Sattath [AS13] recently.
منابع مشابه
A constructive quantum Lovasz local lemma for commuting projectors
The Quantum Satisfiability problem generalizes the Boolean satisfiability problem to the quantum setting by replacing classical clauses with local projectors. The Quantum Lovász Local Lemma gives a sufficient condition for a Quantum Satisfiability problem to be satisfiable [AKS12], by generalizing the classical Lovász Local Lemma. The next natural question that arises is: can a satisfying quant...
متن کاملA Kolmogorov Complexity Proof of the Lovász Local Lemma for Satis ability ∗
Recently, Moser and Tardos [MT10] came up with a constructive proof of the Lovász Local Lemma. In this paper, we give another constructive proof of the lemma, based on Kolmogorov complexity. Actually, we even improve the Local Lemma slightly.
متن کاملAn alternative proof for the constructive Asymmetric Lovász Local Lemma
We provide an alternative constructive proof of the Asymmetric Lovász Local Lemma. Our proof uses the classic algorithmic framework of Moser and the analysis introduced by Giotis, Kirousis, Psaromiligkos, and Thilikos in " On the algorithmic Lovász Local Lemma and acyclic edge coloring " , combined with the work of Bender and Richmond on the multivariable Lagrange Inversion formula.
متن کاملA Kolmogorov Complexity Proof of the Lovász Local Lemma for Satisfiability
Recently, Moser and Tardos [MT10] came up with a constructive proof of the Lovász Local Lemma. In this paper, we give another constructive proof of the lemma, based on Kolmogorov complexity. Actually, we even improve the Local Lemma slightly.
متن کاملThree Proofs of a Constructive Commuting Quantum Lovász Local Lemma
The recently proven Quantum Lovász Local Lemma generalises the well-known Lovász Local Lemma. It states that, if a collection of subspace constraints are “weakly dependent”, there necessarily exists a state satisfying all constraints. It implies e.g. that certain instances of the quantum k–QSAT satisfiability problem are necessarily satisfiable, or that many-body systems with “not too many” int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1311.6474 شماره
صفحات -
تاریخ انتشار 2013